Optimization over Positive Polynomial Matrices
نویسندگان
چکیده
Positive polynomial matrices play a fundamental role in systems and control theory. We give here a simplified proof of the fact that the convex set of positive polynomial matrices can be parameterized using block Hankel and block Toeplitz matrices. We also show how to derive efficient computational algorithms for optimization problems over positive pseudo polynomial matrices over the real line, over the imaginary axis and over the unit circle.
منابع مشابه
Convex Optimization over Positive Polynomials and Filter Design
Positive polynomial matrices play a fundamental role in systems and control theory: they represent e.g. spectral density functions of stochastic processes and show up in spectral factorizations, robust control and filter design problems. Positive polynomials obviously form a convex set and were recently studied in the area of convex optimization [1, 5]. It was shown in [2, 5] that positive poly...
متن کاملCompletely positive reformulations for polynomial optimization
Polynomial optimization encompasses a very rich class of problems in which both the objective and constraints can be written in terms of polynomials on the decision variables. There is a well established body of research on quadratic polynomial optimization problems based on reformulations of the original problem as a conic program over the cone of completely positive matrices, or its conic dua...
متن کاملStability of 2-d Polynomial Matrices
Necessary and suucient conditions are formulated for checking stability of a 2-D polynomial matrix. The conditions stem from a general optimization methodology mixing LFRs, LMIs and the S-procedure. They are expressed as a tractable linear programming problem over the cone of positive semideenite matrices.
متن کاملSums of Squares, Moment Matrices and Optimization over Polynomials
We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and inequalities, which is NP-hard in general. Hierarchies of semidefinite relaxations have been proposed in the literature, involving positive semidefinite moment matrices and the dual theory of sums of squares of polynomials. We present these hierarchies of approximations and their main...
متن کاملFrom combinatorial optimization to real algebraic geometry and back
In this paper, we explain the relations between combinatorial optimization and real algebraic geometry with a special focus to the quadratic assignment problem. We demonstrate how to write a quadratic optimization problem over discrete feasible set as a linear optimization problem over the cone of completely positive matrices. The latter formulation enables a hierarchy of approximations which r...
متن کامل